Optimal connection strategies in one- and two-dimensional associative memory models

نویسندگان

  • Lee Calcraft
  • Rod Adams
  • Neil Davey
چکیده

This study examines the performance of sparsely-connected associative memory models built using a number of different connection strategies, applied to oneand two-dimensional topologies. Efficient patterns of connectivity are identified which yield high performance at relatively low wiring costs in both topologies. It is found that two-dimensional models are more tolerant of variations in connection strategy than their one-dimensional counterparts; though networks built with both topologies become less so as their connection density is decreased. Keywords—Associative memory models, efficient connection strategies, sparse connectivity, comparing 1D and 2D topologies

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Efficient connection strategies in 1D and 2D associative memory models with and without displaced connectivity

This study examines the performance of sparsely connected associative memory models built using a number of different connection strategies, applied to one- and two-dimensional topologies. Efficient patterns of connectivity are identified which yield high performance at relatively low wiring costs in both topologies. Networks with displaced connectivity are seen to perform particularly well. It...

متن کامل

Efficient architectures for sparsely-connected high capacity associative memory models

In physical implementations of associative memory, wiring costs play a significant role in shaping patterns of connectivity. In this study of sparsely-connected associative memory, a range of architectures is explored in search of optimal connection strategies which maximise pattern-completion performance, while at the same time minimising wiring costs. It is found that architectures in which t...

متن کامل

Using graph-theoretic measures to predict the performance of associative memory models

We test a selection of associative memory models built with different connection strategies, exploring the relationship between the structural properties of each network and its pattern-completion performance. It is found that the Local Efficiency of the network can be used to predict pattern completion performance for associative memory models built with a range of different connection strateg...

متن کامل

Associative learning and memory duration of Trichogramma brassicae

Learning ability and memory duration are two inseparable factors which can increase theefficiency of a living organism during its lifetime. Trichgramma brassice Bezdenko (Hym.:Trichogrammatidae) is a biological control agent widely used against different pest species.This research was conducted to study the olfactory associative learning ability and memoryduration of T. brassicae under laborato...

متن کامل

Synthesis of a nonrecurrent associative memory model based on a nonlinear transformation in the spectral domain

A new nonrecurrent associative memory model is proposed. This model is composed of a nonlinear transformation in the spectral domain followed by the association. The Moore-Penrose pseudoinverse is employed to obtain the least squares optimal solution. Computer simulations are done to evaluate the performance of the model. The simulations use one-dimensional speech signals and two-dimensional he...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2007